- bounding step
- прыжок шагом
English-Russian sports dictionary. - Russkiy yazyk Media. I.V. Nechaev. 2006.
bounding step
Смотреть что такое "bounding step" в других словарях:
Bounding interval hierarchy — A bounding interval hierarchy (BIH) is a partitioning data structure similar to that of bounding volume hierarchies or kd trees. Bounding interval hierarchies can be used in high performance (or real time) ray tracing and may be especially useful … Wikipedia
skip — I. verb (skipped; skipping) Etymology: Middle English skippen, perhaps of Scandinavian origin; akin to Swedish dialect skopa to hop Date: 14th century intransitive verb 1. a. to move or proceed with leaps and bounds or with a skip b. to bound off … New Collegiate Dictionary
Collision detection — For collision detection on networks see CSMA/CD Collision detection typically refers to the computational problem of detecting the intersection of two or more objects. While the topic is most often associated with its use in video games and other … Wikipedia
Green's function — In mathematics, Green s function is a type of function used to solve inhomogeneous differential equations subject to boundary conditions. The term is used in physics, specifically in quantum field theory and statistical field theory, to refer to… … Wikipedia
List of Boogiepop characters — Characters of the Boogiepop series, by Kouhei Kadono. The Boogiepop series includes fourteen light novels, a live action film, an anime, two manga, and several short stories. While most characters feature in multiple titles in the series, every… … Wikipedia
Branch and bound — (BB) is a general algorithm for finding optimal solutions of various optimization problems, especially in discrete and combinatorial optimization. It consists of a systematic enumeration of all candidate solutions, where large subsets of… … Wikipedia
Sweep and prune — In physical simulations, sweep and prune is a broad phase algorithm used during collision detection to limit the number of pairs of solids that need to be checked for collision, i.e. intersection. This is achieved by sorting the starts (lower… … Wikipedia
List of mathematics articles (B) — NOTOC B B spline B* algebra B* search algorithm B,C,K,W system BA model Ba space Babuška Lax Milgram theorem Baby Monster group Baby step giant step Babylonian mathematics Babylonian numerals Bach tensor Bach s algorithm Bachmann–Howard ordinal… … Wikipedia
Definition — For other uses, see Definition (disambiguation). A definition is a passage that explains the meaning of a term (a word, phrase or other set of symbols), or a type of thing. The term to be defined is the definiendum. A term may have many different … Wikipedia
Faraday paradox — This article describes the Faraday paradox in electromagnetism. There is a different Faraday paradox in electrochemistry: see Faraday paradox (electrochemistry). The Faraday paradox (or Faraday s paradox) is an experiment that illustrates Michael … Wikipedia
Backtracking — is a type of algorithm that is a refinement of brute force search. [cite web | url=http://www.cse.ohio state.edu/ gurari/course/cis680/cis680Ch19.html#QQ1 51 128 Backtracking algorithms | title=CIS 680: DATA STRUCTURES: Chapter 19: Backtracking… … Wikipedia
